bba91f8aed323a9240c3a28e8349ffe4abcc24f6,elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/MiniMax.java,MiniMax,updateMatrices,#number#number[]#ArrayModifiableDBIDs#DBIDArrayIter#DBIDArrayIter#WritableDBIDDataStore#WritableDoubleDataStore#WritableDBIDDataStore#TIntObjectHashMap#DistanceQuery#number#,220
Before Change
int x = c;
int y = 0;
ix.seek(x);
for(; y < x; y++) {
iy.seek(y);
// Skip entry if already merged
if(lambda.doubleValue(iy) < Double.POSITIVE_INFINITY) {
continue;
After Change
// Update entries at (c,y) with y < c
ix.seek(c);
for(iy.seek(0); iy.getOffset() < c; iy.advance()) {
// Skip entry if already merged
if(lambda.doubleValue(iy) < Double.POSITIVE_INFINITY) {
continue;